Strategy-Proofness and the Core in House Allocation Problems

نویسنده

  • Eiichi Miyagawa
چکیده

We study house allocation problems introduced by Shapley and Scarf (1974). We prove that a mechanism (a social choice function) is individually rational, anonymous, strategy-proof, and non-bossy (but not necessarily Pareto efficient) if and only if it is either the core mechanism or the no-trade mechanism, where the no-trade mechanism is the one that selects the initial allocation for each profile of preferences. This confirms the intuition that even if we are willing to accept inefficiency, there exists no interesting strategy-proof mechanism other than the core mechanism. Journal of Economic Literature Classification Numbers: C71, C78, D71, D78, D89.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single - Valued Cores

IN THIS PAPER WE SEARCH for solutions to various classes of allocation problems. We Ž require them to be Pareto efficient and indi idually rational in the sense that no agent is . ever worse off than he would be on his own . In addition to these minimal requirements we also would like agents not to be able to profitably misrepresent their preferences. This property is known as strategy-proofnes...

متن کامل

House Allocation with Transfers

We consider the Shapley-Scarf house allocation problem where monetary transfers are allowed. We characterize the class of mechanisms that are strategy-proof, ex post individually rational, ex post budget balanced, and “collusion-proof.” In these mechanisms, the price of each object is fixed in advance, and the objects are reallocated according to the (unique) core assignment of the Shapley-Scar...

متن کامل

Object allocation via deferred-acceptance: Strategy-proofness and comparative statics

We study the problem of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, school or university admissions etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We consider mechanisms satisfying a set of basic properties (unavailable-type-invariance, individual-rationality, weak non-wastefulness, or truncation-invariance)....

متن کامل

Consistent strategy-proof assignment by hierarchical exchange

We characterize the family of efficient, consistent, and strategy-proof rules in house allocation problems. These rules follow an endowment inheritance and trade procedure as in Pápai’s Hierarchical Exchange rules [Pápai, S., 2000. Strategy-proof assignment by hierarchical exchange, Econometrica 68, 1403-1433] and closely resemble Ergin’s Priority Rules [Ergin, H., 2002. Efficient resource allo...

متن کامل

Tops Responsiveness, Strategy-proofness and Coalition Formation Problems*

This paper introduces a property over agents’ preferences, called Tops Responsiveness Condition. Such a property guarantees that the core in Hedonic Coalition Formation games is not empty. It is also shown that a mechanism exists that selects a stable allocation. It turns out that this mechanism, to be called tops covering, is strategy-proof even if the core is not a singleton. Furthermore, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2002